On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems
نویسندگان
چکیده
We investigate techniques to discover and exploit problem structure in the form of interchangeability. We enhance the performance of backtrack search with forward-checking (FC-BT) for finding all solutions to a finite Constraint Satisfaction Problem(CSP) with dynamic interchangeability detection and dynamic variable ordering. We evaluate these strategies both theoretically and empirically.
منابع مشابه
How the Level of Interchangeability Embedded in a Finite Constraint Satisfaction Problem Affects the Performance of Search
We investigate how the performance of search for solving finite constraint satisfaction problems (CSPs) is affected by the level of interchangeability embedded in the problem. First, we describe a generator of random CSPs that allows us to control the level of interchangeability in an instance. Then we study how the varying level of interchangeability affects the performance of search for findi...
متن کاملContext in Discrete Constraint Satisfaction Problems
In this paper, we study interchangeability in finite and discrete constraint satisfaction problems (CSPs). In many applications modeled as CSPs, it is important to be able to build on the spot equivalence classes of objects of the world to allow local modifications of the solutions and highlight opportunities for change. The concept of interchangeability, defined by Freuder [4], formalizes equi...
متن کاملCombining Ordering Heuristics and Bundling Techniques for Solving Finite Constraint Satisfaction Problems
We investigate techniques to enhance the performance of backtrack search procedure with forward-checking (FC-BT) for finding all solutions to a finite Constraint Satisfaction Problem (CSP). We consider ordering heuristics for variables and/or values and bundling techniques based on the computation of interchangeability. While the former methods allow us to traverse the search space more effecti...
متن کاملTechniques for Bundling the Solution Space of Finite Constraint Satisfaction Problems
We study the backtrack-search procedure with forward checking (FCBT) for finding all solutions to a finite Constraint Satisfaction Problem (CSP). We describe how to use dynamic interchangeability to enhance the performance of search and represent the solution space in a compact manner. We evaluate this strategy (FC-DNPI) in terms of the numbers of nodes visited, constraints checked, and solutio...
متن کاملOn the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSPs and we introduced two notions of relaxations based on degradation δ and on threshold α (neighborhood interchangeability (αNI )and αneighborhood interchangeability NI ). In this paper we study the presence of these rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001